Title: Ip Lookup under a Persistent Data Structure (offline)

نویسندگان

  • Tobias Langner
  • Christine Maindorfer
  • Khaireel A. Mohamed
چکیده

In many applications, the rule to be applied is chosen based on a single field of the packet header: the destination address. When an incoming packet matches more than one filter and there is no criterion that breaks the tie (either to pick the filter with the highest priority, or to pick the most-specific filter, etc.), the router cannot unambiguously categorise the packet. Thus, one considers such filters as conflicting. There are several aspects that make up a filter conflict [1, 2] and several approaches to detect and resolve conflicting filters [2, 3, 4]. In particular, the SlabDetect algorithm [4] does so by partitioning the universe of addresses into several slabs determined by the endpoints of the filters in the filter set. SlabDetect processes those slabs in a sweep-line approach and ensures, that each slab is dominated by a single most-specific filter.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

Hardware-based IP Routing Lookup with Incremental Update

Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routi...

متن کامل

Searching the Integers

Consider an ordered universe U , and a set T ⊂ U with |T | = n. The goal is to preprocess T , such that the following query can be answered efficiently: given x ∈ U , report the predecessor of x, i.e. max{y ∈ T | y < x}. We can also consider the dynamic problem, where elements are inserted and deleted into T . Let tq be the query time, and tu the update time. This is a fundamental search proble...

متن کامل

Searching the Integers (2006; Pǎtraşcu, Thorup)

Consider an ordered universe U , and a set T ⊂ U with |T | = n. The goal is to preprocess T , such that the following query can be answered efficiently: given x ∈ U , report the predecessor of x, i.e. max{y ∈ T | y < x}. One can also consider the dynamic problem, where elements are inserted and deleted into T . Let tq be the query time, and tu the update time. This is a fundamental search probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006